2 research outputs found
Metric dimension of Andrásfai graphs
A set is called a resolving set, if for each pair of distinct vertices there exists such that , where is the distance between vertices and . The cardinality of a minimum resolving set for is called the metric dimension of and is denoted by . This parameter has many applications in different areas. The problem of finding metric dimension is NP-complete for general graphs but it is determined for trees and some other important families of graphs. In this paper, we determine the exact value of the metric dimension of Andrásfai graphs, their complements and . Also, we provide upper and lower bounds for